A Neumann Problem with Asymmetric Nonlinearity and a Related Minimizing Problem
نویسندگان
چکیده
منابع مشابه
A Boundary Meshless Method for Neumann Problem
Boundary integral equations (BIE) are reformulations of boundary value problems for partial differential equations. There is a plethora of research on numerical methods for all types of these equations such as solving by discretization which includes numerical integration. In this paper, the Neumann problem is reformulated to a BIE, and then moving least squares as a meshless method is describe...
متن کاملMatrix representation of a sixth order Sturm-Liouville problem and related inverse problem with finite spectrum
In this paper, we find matrix representation of a class of sixth order Sturm-Liouville problem (SLP) with separated, self-adjoint boundary conditions and we show that such SLP have finite spectrum. Also for a given matrix eigenvalue problem $HX=lambda VX$, where $H$ is a block tridiagonal matrix and $V$ is a block diagonal matrix, we find a sixth order boundary value problem of Atkin...
متن کاملA multi-objective memetic algorithm for risk minimizing vehicle routing problem and scheduling problem
In this paper, a new approach to risk minimizing vehicle routing and scheduling problem is presented. Forwarding agents or companies have two main concerns for the collection of high-risk commodities like cash or valuable commodities between the central depot and the customers: one; because of the high value of the commodities transported, the risk of ambush and robbery are very high. Two; the ...
متن کاملa boundary meshless method for neumann problem
boundary integral equations (bie) are reformulations of boundary value problems for partial differential equations. there is a plethora of research on numerical methods for all types of these equations such as solving by discretization which includes numerical integration. in this paper, the neumann problem is reformulated to a bie, and then moving least squares as a meshless method is describe...
متن کاملMinimizing the Mean Tardiness in A N1 Sequencing Problem
This paper considers the problem of minimizing the mean tardiness of N jobs when the jobs are scheduled on a single machine. A simple algorithmic procedure is develop to obtain an optimal or a near optimal sequence for the N jobs while considering an equal penalty cost incurred to each job delivered later than its due date. The developed algorithm is applied to the several test problems. The re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Differential Equations
سال: 1998
ISSN: 0022-0396
DOI: 10.1006/jdeq.1997.3396